Classification of scale-free networks

Classification of scale-free networks.

While the emergence of a power-law degree distribution in complex networks is intriguing, the degree exponent is not universal. Here we show that the between ness centrality displays a power-law distribution with an exponent eta, which is robust, and use it to classify the scale-free networks. We have observed two universality classes with eta approximately equal 2.2(1) and 2.0, respectively. R...

O ct 2 00 2 Classification of scale free networks

While the emergence of a power law degree distribution in complex networks is intriguing, the degree exponent is not universal. Here we show that the betweenness centrality displays a power-law distribution with an exponent η which is robust and use it to classify the scale-free networks. We have observed two universality classes with η ≈ 2.2(1) and 2.0, respectively. Real world networks for th...

Exactly scale-free scale-free networks

Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to model the growth and structure of scale-free networks. With so many different models of scale-free networks it is unclear what properties of scale-free networks ...

Deterministic Scale-Free Networks

Scale-free networks are abundant in nature, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are stochastic, that is they create networks in which the nodes appear to be randomly connected to each other. Here we propose a simple model that generates scale-free networks in...

Scale-free networks